Predicting and Identifying Missing Node Information in Social Networks
نویسندگان
چکیده
منابع مشابه
Identifying Missing Node Information in Social Networks
In recent years, social networks have surged in popularity as one of the main applications of the Internet. This has generated great interest in researching these networks by various fields in the scientific community. One key aspect of social network research is identifying important missing information which is not explicitly represented in the network, or is not visible to all. To date, this...
متن کاملSampling node group structure of social and information networks
Lately, network sampling proved as a promising tool for simplifying large real-world networks and thus providing for their faster and more efficient analysis. Still, understanding the changes of network structure and properties under different sampling methods remains incomplete. In this paper, we analyze the presence of characteristic group of nodes (i.e., communities, modules and mixtures of ...
متن کاملIdentifying Super-Mediators of Information Diffusion in Social Networks
We propose a method to discover a different kind of influential nodes in a social network, which we call “super-mediators”, i.e., those nodes which play an important role in receiving the information and passing it to other nodes. We mathematically formulate this as a difference maximization problem in the average influence degree with respect to a node removal, i.e., a node that contributes to...
متن کاملIdentifying Event Context Using Anchor Information in Online Social Networks
Online social networks (OSNs) such as Twitter provide a good platform for event discussions. Recent research [26] [25] has shown that event discussions in OSNs are diverse and innovative and encourage public engagement in events. Although much research has been conducted in OSNs to track and detect events, there has been limited research on detecting or understanding the event context. Event co...
متن کاملPredicting missing links and identifying spurious links via likelihood analysis
Real network data is often incomplete and noisy, where link prediction algorithms and spurious link identification algorithms can be applied. Thus far, it lacks a general method to transform network organizing mechanisms to link prediction algorithms. Here we use an algorithmic framework where a network's probability is calculated according to a predefined structural Hamiltonian that takes into...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Knowledge Discovery from Data
سال: 2014
ISSN: 1556-4681,1556-472X
DOI: 10.1145/2536775